Public-key encryption with chaos.
نویسندگان
چکیده
We propose public-key encryption algorithms based on chaotic maps, which are generalization of well-known and commercially used algorithms: Rivest-Shamir-Adleman (RSA), ElGamal, and Rabin. For the case of generalized RSA algorithm we discuss in detail its software implementation and properties. We show that our algorithm is as secure as RSA algorithm.
منابع مشابه
A Novel Image Encryption Model Based on Hybridization of Genetic Algorithm, Chaos Theory and Lattice Map
Encryption is an important issue in information security which is usually provided using a reversible mathematical model. Digital image as a most frequently used digital product needs special encryption algorithms. This paper presents a new encryption algorithm high security for digital gray images using genetic algorithm and Lattice Map function. At the first the initial value of Logistic Map ...
متن کاملSurvey Report on Chaos Based Public-key Cryptosystem
In recent years, encryption technology has been developed rapidly the chaos based cryptographic algorithms. Chaos owns certain critical properties such as sensitive dependence on initial condition, random-like behavior, and continuous broadband power spectrum, which match the confusion, diffusion, and key sensitivity requirements for cryptography. Chaos based cryptographic offer sundry features...
متن کاملA stack-based chaotic algorithm for encryption of colored images
In this paper, a new method is presented for encryption of colored images. This method is based on using stack data structure and chaos which make the image encryption algorithm more efficient and robust. In the proposed algorithm, a series of data whose range is between 0 and 3 is generated using chaotic logistic system. Then, the original image is divided into four subimages, and these four i...
متن کاملChaos-based Cryptography: an overview
We review some of the recent work on chaos-based cryptography. We argue that if a chaotic map f is used in cryptography, then it should be implemented as a bijection FM : D → D, where D is a finite set with cardinality M, such that, for large M, FM ‘approximates well’ the chaotic map f . Several examples, including chaotic block cypher and chaotic public-key encryption algorithm, are given.
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Chaos
دوره 14 4 شماره
صفحات -
تاریخ انتشار 2004